Shared resource aware scheduling on power-constrained tiled many-core processors
نویسندگان
چکیده
منابع مشابه
Power Aware Scheduling for Resource Constrained Distributed Real-Time Systems
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time systems, there is less work done on their multicomputer counterparts. For a set of real-time tasks with precedence and resource constraints executing on a distributed system, we propose a dynamic slack management tech...
متن کاملEnergy-Constrained Scheduling of DAGs on Multi-core Processors
This paper proposes a technique to minimize the makespan of DAGs under energy constraints on multi-core processors that often need to operate under strict energy constraints. Most of the existing work aims to reduce energy subject to performance constraints. Thus, our work is in contrast to these techniques, and it is useful because one can encounter numerous energy-constraint scenarios in real...
متن کاملCore Power Management Issues in Asymmectric Multi/Many-Core Processors
Power managing is a major issue in designing the future asymmectric multi/many-core processors. The challenge is to provide a solution that has low power consumption, in addition to trade off a small decrease in performance and throughput. Our design includes asymmetric cores in consideration of different points in the view of power-performance efficiency during an application’s execution. In t...
متن کاملAccelerating Communication in Single-chip Shared Memory Many-core Processors
Shared Memory stands out as a sine qua non for parallel programming of many commercial multicore processors. For efficiency, shared memory is often implemented with hardware support for cache coherence and memory consistency among the cores. It optimizes patterns of communication that benefit common programming styles. As parallel programming is now mainstream, those common programming styles a...
متن کاملHistory-aware, resource-based dynamic scheduling for heterogeneous multi-core processors
In this work we introduce a history-aware, resourcebased dynamic (or simply HARD) scheduler for heterogeneous CMPs. HARD relies on recording application resource utilization and throughput to adaptively change cores for applications during runtime. We show that HARD can be configured to achieve both performance and power improvements. We compare HARD to a complexity-based static scheduler and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2017
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2016.10.001